Cyclic Bernoulli polling
نویسندگان
چکیده
منابع مشابه
Cyclic Bernoulli Polling I
We introduce, analyse and optimize the class of Bernoulli random polling systems. The server moves cyclically among N channels (queues), but Change-over times between stations are composed of walking times required to 'move' from one channel to another and switch-in times that are incurred only when the server actually enters a station to render service. The server uses a Bernoulli random mecha...
متن کاملClosed polling models with failing nodes
Closed polling systems with station breakdowns, under the Gated, Exhaustive or Globally Gated services regimes, are studied and analyzed. Multi-dimensional sets of probability generating functions of the system's state are derived. They are further utilized to obtain an approximate solution for the mean number of jobs residing in the system's various queues at polling instants. The analysis is ...
متن کاملApproximation of discrete-time polling systems via structured Markov chains
We devise an approximation of the marginal queue length distribution in discrete-time polling systems with batch arrivals and fixed packet sizes. The polling server uses the Bernoulli service discipline and Markovian routing. The 1-limited and exhaustive service disciplines are special cases of the Bernoulli service discipline, and traditional cyclic routing is a special case of Markovian routi...
متن کاملThe Upper Bounds for Performance Measures of a Finite Capacity Polling System under ATM Bursty Arrivals
This paper focuses on the upper bounds for both the mean delay and the loss probability that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is assumed to be bursty and is modeled by an Interrupted Bernoulli Process(IBP). We compute the upper bounds f...
متن کاملOptimization of Polling Systems with Bernoulli Schedules
Many computer-communication networks in which the transmission right is circulated among the nodes have been modeled as polling systems. This paper concerns optimization of cyclic polling systems with respect to the service disciplines at the nodes. The service disciplines are chosen to be Bernoulli schedules. Because the optimization problem is not analytically tractable, a numerical approach ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ZOR - Meth. & Mod. of OR
دوره 38 شماره
صفحات -
تاریخ انتشار 1993